A matrix nullspace approach for solving equality-constrained multivariable polynomial least-squares problems
نویسندگان
چکیده
منابع مشابه
A matrix nullspace approach for solving equality-constrained multivariable polynomial least-squares problems
We present an elimination theory-based method for solving equality-constrained multivariable polynomial least-squares problems in system identification.Whilemost algorithms in elimination theory rely upon Groebner bases and symbolic multivariable polynomial division algorithms, we present an algorithm which is based on computing the nullspace of a large sparse matrix and the zeros of a scalar, ...
متن کاملAn Equality Constrained Least Squares Approach to the Structural Reanalysis
An efficient method for reanalysis of a damaged structures is presented. Perturbation analysis for the equality constrained least squares problem is adapted to handle structural reanalysis, and related theoretical and numerical results are presented.
متن کاملDykstra's algorithm for constrained least-squares doubly symmetric matrix problems
In this work we apply Dykstra’s alternating projection algorithm for minimizing ‖AX − B‖ where ‖ · ‖ is the Frobenius norm and A ∈ Rm×n, B ∈ Rm×n and X ∈ Rn×n are doubly symmetric positive definite matrices with entries within prescribed intervals. We first solve the constrained least-squares matrix problem by using the special structure properties of doubly symmetric matrices, and then use the...
متن کاملSolving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
We introduce a partial proximal point algorithm for solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints. For the inner subproblems, we show that the positive definiteness of the generalized Hessian of the objective function for the inner subproblems is equivalent to the constraint nondegeneracy of the corresponding primal problem, whi...
متن کاملSolving polynomial least squares problems via semidefinite programming relaxations
A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomial least squares problem to polynomial semidefinite programs to reduce degrees of the polynomials are discussed. Computational efficiency of solving the original polynomial least sq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2014
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2014.10.039